Time-Dependent Queue-Size Distribution in the Finite GI/M/l Model with AQM-Type Dropping
نویسندگان
چکیده
منابع مشابه
Time-dependent Queue-size Distribution in the Finite Gi/m/1 Model with Aqm-type Dropping
A GI/M/1-type queueing system with finite buffer capacity and AQM-type packet dropping is investigated. Even when the buffer is not saturated an incoming packet can be dropped (lost) with probability dependent on the instanteneous queue size. The system of integral equations for time-dependent queue-size distribution conditioned by the number of packets present in the system initially is built ...
متن کاملAnalysis of AQM Queues with Queue Size Based Packet Dropping
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size d...
متن کاملA Direct Approach to Transient Queue-Size Distribution in a Finite-Buffer Queue with AQM
A finite-buffer M/G/1-type queueing model is considered in which the level of saturation of the buffer is controlled by a dropping function. A direct analytical method to the study of the transient queue-size distribution is proposed. Applying the embedded Markov chain paradigm and the formula of total probability, a specific-type system of integral equations for the transient queue-size distri...
متن کاملAnalysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service
Over the last two decades there has been considerable growth in digital communication systems which operate on a slotted system. In several applications, transmission of packets over the network takes place in batches of varying size, and transmission time depends upon the size of the batch. Performance modelling of these systems is usually done using discrete-time queues. In view of this, we c...
متن کاملAdaptive Mean Queue Size and Its Rate of Change: Queue Management with Random Dropping
The Random early detection (RED) active queue management (AQM) scheme uses the average queue size to calculate the dropping probability in terms of minimum and maximum thresholds. The effect of heavy load enhances the frequency of crossing the maximum threshold value resulting in frequent dropping of the packets. An adaptive queue management with random dropping (AQMRD) algorithm is proposed wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Electrotechnica et Informatica
سال: 2013
ISSN: 1335-8243,1338-3957
DOI: 10.15546/aeei-2013-0054